#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=70;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn][maxn];
LL p[maxn];
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  p[0]=1;
  for(LL i=1;i<maxn;i++) p[i]=p[i-1]*2;
  LL k;cin>>k;
  if(k==0){
    cout<<1<<" "<<1<<"\n";
    cout<<1<<"\n";
  }
  else{
    cout<<2<<" "<<3<<"\n";
    LL sum=0;
    for(LL i=0;i<=17;i++) sum+=p[i];
    a[1][1]=sum;
    a[1][2]=p[17];
    a[1][3]=0;
    a[2][1]=k;
    a[2][2]=sum;
    a[2][3]=k;
    for(LL i=1;i<=2;i++){
        for(LL j=1;j<=3;j++){
            cout<<a[i][j]<<" ";
        }
        cout<<"\n";
    }
  }
return 0;
}
